Quotients, inductive types, and quotient inductive types
نویسندگان
چکیده
This paper introduces an expressive class of indexed quotient-inductive types, called QWI within the framework constructive type theory. They are initial algebras for families equational theories with possibly infinitary operators and equations. We prove that types can be derived from quotient inductive in theory toposes natural number object universes, provided those universes satisfy Weakly Initial Set Covers (WISC) axiom. do so by constructing as colimits a family approximations to them defined well-founded recursion over suitable notion size, whose definition involves WISC developed proof checked it using Agda theorem prover.
منابع مشابه
Quotient inductive-inductive types
Higher inductive types (HITs) in Homotopy Type Theory (HoTT) allow the definition of datatypes which have constructors for equalities over the defined type. HITs generalise quotient types, and allow to define types which are not sets in the sense of HoTT (i.e. do not satisfy uniqueness of equality proofs) such as spheres, suspensions and the torus. However, there are also interesting uses of HI...
متن کاملType theory in a type theory with quotient inductive types
Type theory (with dependent types) was introduced by Per Martin-Löf with the intention of providing a foundation for constructive mathematics. A part of constructive mathematics is type theory itself, hence we should be able to say what type theory is using the formal language of type theory. In addition, metatheoretic properties of type theory such as normalisation should be provable in type t...
متن کاملA Syntax for Higher Inductive-Inductive Types∗
Higher inductive-inductive types (HIITs) generalise inductive types of dependent type theories in two directions. On the one hand they allow the simultaneous definition of multiple sorts that can be indexed over each other. On the other hand they support equality constructors, thus generalising higher inductive types of homotopy type theory. Examples that make use of both features are the Cauch...
متن کاملRefining Inductive Types
Dependently typed programming languages allow sophisticated properties of data to be expressed within the type system. Of particular use in dependently typed programming are indexed types that refine data by computationally useful information. For example, the N-indexed type of vectors refines lists by their lengths. Other data types may be refined in similar ways, but programmers must produce ...
متن کاملOrder-Sorted Inductive Types
System F ! is an extension of system F ! with subtyping and bounded quantiication. Order-sorted algebra is an extension of many-sorted algebra with overloading and subtyping. We combine both formalisms to obtain IF ! , a higher-order typed-calculus with subtyping, bounded quan-tiication and order-sorted inductive types, i.e. data types with built-in subtyping and overloading. Moreover we show t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2022
ISSN: ['1860-5974']
DOI: https://doi.org/10.46298/lmcs-18(2:15)2022